Speeding up Martins' algorithm for multiple objective shortest path problems

The latest transportation systems require the best routes in a large network with respect tomultiple objectives simultaneously to be calculated in a very short time. The label setting algorithm ofMartins efficiently finds this set of Pareto optimal paths, but sometimes tends to be slow, especially for large networks such as transportation networks. In this article we investigate a number of speedup measures, resulting in new algorithms. It is shown that the calculation time to find the Pareto optimal set can be reduced considerably. Moreover, it is mathematically proven that these algorithms still produce the Pareto optimal set of paths.